UPPER BOUNDS FOR THE STABILITY NUMBER OF A GRAPHHANSEN P.1979; REV. ROUMAINE MATH. PURES APPL.; ROM; DA. 1979; VOL. 24; NO 8; PP. 1195-1199; BIBL. 6 REF.Article

UEBER N-FACH ZUSAMMENHAENGENDE ECKENMENGEN IN GRAPHEN. = SUR DES ENSEMBLES DE NOEUDS N-CONNEXES DANS DES GRAPHESMADER W.1978; J. COMBINATOR THEORY; USA; DA. 1978; VOL. 25; NO 1; PP. 74-93; ABS. ENG; BIBL. 15 REF.Article

EDGE DISJOINT PLACEMENT OF GRAPHSSAUER N; SPENCER J.1978; J. COMBINATOR. THEORY, B; USA; DA. 1978; VOL. 25; NO 3; PP. 295-302; BIBL. 3 REF.Article

A NOTE ON COMPACT SETS IN GRAPHSLODI E; LUCCIO F.1978; RIC. DI AUTOMAT.; ITA; DA. 1978; VOL. 9; NO 1; PP. 86-91; BIBL. 1 REF.Article

THE LARGEST VERTEX DEGREE SUM FOR A TRIANGLE IN A GRAPH.EDWARDS CS.1977; BULL. LONDON MATH. SOC.; G.B.; DA. 1977; VOL. 9; NO 26; PP. 203-208; BIBL. 1 REF.Article

ON PROBLEMS RELATED TO CHARACTERISTIC VERTICES OF GRAPHSSZAMKOLOWICZ L.1979; COLLOQ. MATH.; POL; DA. 1979; VOL. 42; PP. 367-375; BIBL. 3 REF.Article

DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN, MAXIMAL DEGREE.BOLLOBAS B.1977; QUART. J. MATH.; G.B.; DA. 1977; VOL. 28; NO 109; PP. 81-85; BIBL. 9 REF.Article

LINE REMOVAL ALGORITHMS FOR GRAPHS AND THEIR DEGREE LISTS.BOESCH F; HARARY F.1976; I.E.E.E. TRANS. CIRCUITS SYST.; U.S.A.; DA. 1976; VOL. 23; NO 12; PP. 778-782; BIBL. 13 REF.Article

THE COHESIVENESS OF A POINT OF GRAPHAKIYAMA J; BOESCH F; ERA H et al.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 1; PP. 65-68; BIBL. 2 REF.Article

A LINEAR-TIME APPROXIMATION ALGORITHM FOR THE WEIGHTED VERTEX COVER PROBLEMBAR YEHUDA R; EVEN S.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 2; PP. 198-203; BIBL. 6 REF.Article

VERTEX COLORINGS WITHOUT ISOLATESMAURER SB.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 27; NO 3; PP. 294-319; BIBL. 12 REF.Article

ON MINIMAL 5-CHROMATIC TRIANGLE-FREE GRAPHSAVIS D.1979; J. GRAPH THEORY; USA; DA. 1979; VOL. 3; NO 4; PP. 397-400; BIBL. 5 REF.Article

A PREPROCESSOR FOR ALGORITHMS TO DETERMINE MINIMUM FEEDBACK VERTEX SETSZNOTINAS NM; ROE PH.1979; ICCS 79. INTERNATIONAL CONFERENCE ON CYBERNETICS AND SOCIETY/1979/DENVER CO; USA; NEW YORK: IEEE; DA. 1979; PP. 409-412; BIBL. 6 REF.Conference Paper

VERTEX DEGREES OF PLANAR GRAPHSCOOK RJ.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 26; NO 3; PP. 337-345; BIBL. 1 REF.Article

ENUMERATING A CLASS OF NESTED GROUP TESTING PROCEDURES.MOON JW; SOBEL M.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 23; NO 2-3; PP. 184-188; BIBL. 3 REF.Article

SUI VERTICI E SUGLI SPIGOLI QUASI CRITICI DI UN GRAFO. = SUR LES NOEUDS ET LES COTES QUASI CRITIQUES D'UN GRAPHEDE FLORA A.1975; RIV. MAT. UNIV. PARMA; ITAL.; DA. 1975 PARU 1977; VOL. 4; NO 1; PP. 233-237; ABS. ANGL.; BIBL. 2 REF.Article

MINIMAL SEPARATING SETS OF MAXIMUM SIZEALAVI Y; NEHZAD M; NORDHAUS EA et al.1980; J. COMBINATOR. THEORY, B; USA; DA. 1980; VOL. 28; NO 2; PP. 180-183; BIBL. 6 REF.Article

REFINED VERTEX CODES AND VERTEX PARTITIONING METHODOLOGY FOR GRAPH ISOMORPHISM TESTINGBHAT KVS.1980; IEEE TRANS. SYST. MAN CYBERN.; ISSN 0018-9472; USA; DA. 1980; VOL. 10; NO 10; PP. 610-615; BIBL. 37 REF.Article

NEIGHBORHOOD FIXED PENDANT VERTICESANACKER SE; ROBERTSON GN.1981; TRANS. AM. MATH. SOC.; ISSN 0002-9947; USA; DA. 1981; VOL. 266; NO 1; PP. 115-128; BIBL. 2 REF.Article

ON THE ERDOES-STONE THEOREMCHVATAL V; SZEMEREDI E.1981; J. LOND. MATH. SOC.; ISSN 0024-6107; GBR; DA. 1981; NO 80; PP. 207-214; BIBL. 6 REF.Article

ON THE SIZE OF A MAXIMAL INDUCED TREE IN A RANDOM GRAPHKARONSKI M; PALKA Z.1980; MATH. SLOV.; CSK; DA. 1980; VOL. 30; NO 2; PP. 151-155; ABS. RUS; BIBL. 3 REF.Article

A RECURSIVE ALGORITHM FOR FINDING RELIABILITY MEASURES RELATED TO THE CONNECTION OF NODES IN A GRAPHBUZACOTT JA.1980; NETWORKS; ISSN 0028-3045; USA; DA. 1980; VOL. 10; NO 4; PP. 311-327; BIBL. 14 REF.Article

ON THE VERTEX-K-DEPENDENCE NUMBER IN A CHESS GRAPH.KOMAN M.1976; IN: GRAPHS HYPERGRAPHS BLOCK SYST. SYMP. COMB. ANAL. PROC.; ZIELONA GORA; 1976; ZIELONA GORA; DA. 1976; PP. 119-135; BIBL. 4 REF.Conference Paper

BOUNDS FOR AGGREGATING NODES IN NETWORK PROBLEMSZIPKIN PH.1980; MATH. PROGRAMMG; NLD; DA. 1980; VOL. 19; NO 2; PP. 155-177; BIBL. 12 REF.Article

PARALLEL SORTING WITH CONSTANT TIME FOR COMPARISONSHAEGGKVIST R; HELL P.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 465-472; BIBL. 9 REF.Article